Certain control computations may be modeled as periodic tasks with the correctness requirement that for each task, the fraction of jobs of the task that complete execution by their respective deadlines be no smaller than a speci ed value. This appears to be a correctness requirement that has not previously been studied in the real-time scheduling theory community; this paper formulates the problem and proposes some solution strategies.
A scheduling model inspired by control theory / Baruah, Sanjoy; Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto; Verdugo, Victor. - STAMPA. - 131837:(2017), pp. 78-87. (Intervento presentato al convegno 25th International Conference on Real-Time Networks and Systems, RTNS 2017 tenutosi a Grenoble, France nel 2017) [10.1145/3139258.3139272].
A scheduling model inspired by control theory
Marchetti-Spaccamela, Alberto;
2017
Abstract
Certain control computations may be modeled as periodic tasks with the correctness requirement that for each task, the fraction of jobs of the task that complete execution by their respective deadlines be no smaller than a speci ed value. This appears to be a correctness requirement that has not previously been studied in the real-time scheduling theory community; this paper formulates the problem and proposes some solution strategies.| File | Dimensione | Formato | |
|---|---|---|---|
|
Baruah_A-scheduling-model_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
742.27 kB
Formato
Adobe PDF
|
742.27 kB | Adobe PDF | Contatta l'autore |
|
RTNS2017_Frontespizio-indice_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
288.3 kB
Formato
Adobe PDF
|
288.3 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
